منابع مشابه
The k-ball l-path Branch Weight Centroid
If x is a vertex of a tree T of radius r, if k and 1 are integers, if 0 < k < r, 0 < I < r, and if P is an L-path with one end at x, then define /3(x; k,P) to be the number of vertices of T that are reachable from x via the l-path P and that are outside of the k-ball about x. That is, fl(x; k, P) = 1 (y E V( T ): y is reachable from x via P, d(x, y) > k} I. Define the k-ball l-path branch weigh...
متن کاملFinding the Minimum-Weight k-Path
Given a weighted n-vertex graph G with integer edge-weights taken from a range [−M,M ], we show that the minimum-weight simple path visiting k vertices can be found in time Õ(2poly(k)Mn) = O∗(2kM). If the weights are reals in [1,M ], we provide a (1+ε)-approximation which has a running time of Õ(2poly(k)n(log logM + 1/ε)). For the more general problem of k-tree, in which we wish to find a minim...
متن کاملCentroid Triangulations from k-Sets
Given a set V of n points in the plane, no three of them being collinear, a convex inclusion chain of V is an ordering of the points of V such that no point belongs to the convex hull of the points preceding it in the ordering. We call k-set of the convex inclusion chain, every k-set of an initial subsequence of at least k points of the ordering. We show that the number of such k-sets (without ...
متن کاملA branch-and-bound algorithm for the minimum radius $k$-enclosing ball problem
The minimum k-enclosing ball problem seeks the ball with smallest radius that contains at least k of m given points in a general n-dimensional Euclidean space. This problem is NP-hard. We present a branch-and-bound algorithm on the tree of the subsets of k points to solve this problem. The nodes on the tree are ordered in a suitable way, which, complemented with a last-in-first-out search strat...
متن کاملVariable Length Path Branch Prediction Variable Length Path Branch Prediction
all of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for proot or commercial advantage and that copies bear this notice and the full citation on the rst page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, to republish, to post on servers, ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 1997
ISSN: 0166-218X
DOI: 10.1016/s0166-218x(97)80003-0